Adversary model

Results: 85



#Item
51Online parallel scheduling of non-uniform tasks: Trading failures for energy

Online parallel scheduling of non-uniform tasks: Trading failures for energy

Add to Reading List

Source URL: www.cs.ucy.ac.cy

Language: English - Date: 2015-01-23 01:11:03
52Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts Chryssis Georgiou∗ Department of Computer Science, University of Cyprus [removed]

Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts Chryssis Georgiou∗ Department of Computer Science, University of Cyprus [removed]

Add to Reading List

Source URL: www.cs.ucy.ac.cy

Language: English - Date: 2011-09-05 06:01:37
53Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip∗ Chryssis Georgiou† Seth Gilbert‡

Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip∗ Chryssis Georgiou† Seth Gilbert‡

Add to Reading List

Source URL: www.cs.ucy.ac.cy

Language: English - Date: 2011-10-13 04:45:49
54Mach Learn: 69–83 DOIs10994Mining adversarial patterns via regularized loss minimization Wei Liu · Sanjay Chawla

Mach Learn: 69–83 DOIs10994Mining adversarial patterns via regularized loss minimization Wei Liu · Sanjay Chawla

Add to Reading List

Source URL: www.cmcrc.com

Language: English - Date: 2013-08-20 22:22:50
55Repeated Games against Budgeted Adversaries  Manfred K. Warmuth† Department of Computer Science UC Santa Cruz [removed]

Repeated Games against Budgeted Adversaries Manfred K. Warmuth† Department of Computer Science UC Santa Cruz [removed]

Add to Reading List

Source URL: papers.nips.cc

Language: English - Date: 2014-02-24 03:39:46
56How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal Jacob Abernethy University of Michigan [removed]

How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal Jacob Abernethy University of Michigan [removed]

Add to Reading List

Source URL: papers.nips.cc

Language: English - Date: 2014-11-26 14:13:18
57Minimax Policies for Combinatorial Prediction Games S´ebastien Bubeck1 joint work with Jean-Yves Audibert2,3 and G´ abor Lugosi4

Minimax Policies for Combinatorial Prediction Games S´ebastien Bubeck1 joint work with Jean-Yves Audibert2,3 and G´ abor Lugosi4

Add to Reading List

Source URL: www.princeton.edu

Language: English - Date: 2011-10-05 04:54:04
58NRL Release Number[removed]Dolev-Yao is no better than Machiavelli Paul Syverson, Catherine Meadows  Center for High Assurance Computer Systems

NRL Release Number[removed]Dolev-Yao is no better than Machiavelli Paul Syverson, Catherine Meadows Center for High Assurance Computer Systems

Add to Reading List

Source URL: www.nrl.navy.mil

Language: English - Date: 2013-04-29 11:52:34
59Carleton University Honours Project Knowledge in Rendezvous of Agents with Different Speeds Evan Huus [removed] Supervised by Professor E. Kranakis,

Carleton University Honours Project Knowledge in Rendezvous of Agents with Different Speeds Evan Huus [removed] Supervised by Professor E. Kranakis,

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
60Bounded Memory Protocols Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , Andre Scedrov4 Abstract It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, de

Bounded Memory Protocols Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , Andre Scedrov4 Abstract It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, de

Add to Reading List

Source URL: bib.irb.hr

Language: English - Date: 2014-08-21 13:21:17